Constructing compact rectiliner planar layouts using canonical representation of planar graphs
نویسندگان
چکیده
منابع مشابه
Mixed Linear Layouts of Planar Graphs
A k-stack (respectively, k-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured that every planar graph admits a mixed 1-stack 1-queue layout in which every edge is assigned to a stack or to a queue that use a common vertex orde...
متن کامل1-String CZ-Representation of Planar Graphs
In this paper, we prove that every planar 4-connected graph has a CZ-representation—a string representation using paths in a rectangular grid that contain at most one vertical segment. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. The required size of the grid is n× 2n.
متن کاملNew representation results for planar graphs
A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover width which is a generalization of the bandwidth parameter. Specifically, we show that any planar graph is the intersection graph of one chordal graph, four co-...
متن کاملCompact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
We consider the problem of coding planar graphs by binary strings. Depending on whether O(1)-time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than the previously known results in each case. 1 I n t r o d u c t i o n This paper investigates the problem ...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90349-k